Motion Planning Test Suite
نویسندگان
چکیده
Motion planning is the problem of finding a valid path for a robot from a start to goal configuration. In addition to robotics, it has applications to other fields in computer science such as CAD software, autonomous vehicles, and artificial intelligence. Motion planning in robotics is difficult because of the large number of variables needed to account for a robots shape, size, dynamic environments, and forces such as gravity and friction. Weve designed a test suite to evaluate motion planning algorithms, that is integrated with Parasol Lab’s C++ motion planning library (PMPL), visualization tool (Vizmo++), and a physically based robot simulator. In particular, weve developed benchmark scenarios to exercise motion planning algorithms in a variety of scenarios and for a range of robots. A representative set of problems were designed such as freebody scenarios that varied from two to three dimensions, a crane-like, robot with joints tasked with moving its arm from one location to another, and a car-like robot with different actuators that limited its movement to seem more car-like. These benchmark scenarios will enable the comparison and evaluation of future motion planning algorithms
منابع مشابه
Motion Planning and Control of Robot Manipulators
Oppgavens tittel (norsk): Bevegelsesplanlegging og regulering av robotmanipulatorer Oppgavens tittel (engelsk): Motion planning and control of robot manipulators Bakgrunn: Robot motion planning systems can be used to plan collision-free paths between start and end robot manipulator configurations. Many motion planners assume that the robot manipulator works in a static environment. However, man...
متن کاملMBT 2007 Testing Planning Domains ( without Model Checkers ) 1
We address the problem of verifying planning domains as used in model-based planning, for example in space missions. We propose a methodology for testing flight rules of planning domains which is self-contained, in the sense that flight rules are verified using a planner and no external tools are required. We review and analyse coverage conditions for requirements-based testing, and we reason i...
متن کاملCartesian Motion Planning & Task Programming with CRAFTSMAN
I. INTRODUCTION Deploying multi-degree-of-freedom robot systems in real-world environments will require motion and task planning software for manipulation that is robust, flexible, and easy to use by non-PhD users. While many robot manufacturers provide custom, proprietary solutions for their systems, there is no industry standard that can be used on different platforms, can quickly adjust to n...
متن کاملComputing Parameter Domains as an Aid to Planning
We show that by inferring parametex domains of planning operators, given the definitions of the operators and the initial and goal conditions, we can often speed up the planning process. We infer parameter domains by a polynomial-time algorithm that uses forward propagation of sets of constants occurring in the initial conditions and in operator postconditions. During planning parameter domains...
متن کاملA Machine Learning Approach for Feature-Sensitive Motion Planning
Although there are many motion planning techniques, there is no single one that performs optimally in every environment for every movable object. Rather, each technique has different strengths and weaknesses which makes it best-suited for particular types of situations. Also, since a given environment can consist of vastly different regions, there may not even be a single planner that is well s...
متن کامل